Complexity of First Order ID-Logic
نویسندگان
چکیده
First Order ID-Logic interprets general first order, nonmonotone, inductive definability by generalizing the wellfounded semantics for logic programs. We show that, for general (thus perhaps infinite) structures, inference in First Order ID-Logic is completeΠ2 over the natural numbers. We also prove a Skolem Theorem for the logic: every consistent formula of First Order ID-Logic has a countable model.
منابع مشابه
LPC(ID): A Sequent Calculus Proof System for Propositional Logic Extended with Inductive Definitions
The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. Such logic formally extends logic programming, abductive logic programming and datalog, and thus formalizes the view on these formalisms as logics of (generalized) inductive definitions. The goal of this paper is to study a deductive inference method for PC(ID), w...
متن کاملConnecting First-Order ASP and the Logic FO(ID) through Reducts
Recently, an answer-set programming (ASP) formalism of logic programing with the answer-set semantics has been extended to the full first-order setting. Earlier an extension of first-order logic with inductive definitions, the logic FO(ID), was proposed as a knowledge representation formalism and developed as an alternative ASP language. We present characterizations of these formalisms in terms...
متن کاملSatisfiability Checking for PC(ID)
The logic FO(ID) extends classical first order logic with inductive definitions. This paper studies the satisifiability problem for PC(ID), its propositional fragment. We develop a framework for model generation in this logic, present an algorithm and prove its correctness. As FO(ID) is an integration of classical logic and logic programming, our algorithm integrates techniques from SAT and ASP...
متن کاملNumerical Solution of fuzzy differential equations of nth-order by Adams-Moulton method
In recent years, Fuzzy differential equations are very useful indifferent sciences such as physics, chemistry, biology and economy. It should be noted, that if the equations that appear to be uncertain, then take help of fuzzy logic at these equations. Considering that most of the time analytic solution of such equations and finding an exact solution has either high complexity or cannot be solv...
متن کاملA Deductive System for PC(ID)
The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. This paper studies a deductive inference method for PC(ID), its propositional fragment. We introduce a formal proof system based on the sequent calculus (Gentzen-style deductive system) for this logic. As PC(ID) is an integration of classical propositional logic a...
متن کامل